Some Theorem Proving Aids

Theorem proving can be a very useful formal method. However it currently takes a lot of time and study to learn how to use a theorem prover, and proving even apparently simple theorems can be tedious. Theorem proving, and its beneets in software and hardware development , should be accepted more readily and widely if new users can do larger proofs of more complete models earlier in their training and with less work. We present some generally applicable tools which we found helpful in formally verifying a secure web server. The rst is a program to check goals for common mistakes arising indirectly from type inference. We also give tactics, or proof advancing routines, to simplify goals and handle assumptions. Finally we give tactics which prove goals by selecting assumptions to establish the goal or nd a contradiction. These are another step to making theorem proving easier, increasing productive, and reducing unnecessary complication.